Random Sequence Generation by Cellular Automata
ثبت نشده
چکیده
A J -dimensional cellular automaton which generates random sequences is discussed. Each site in the cellular automaton has value 0 or J, and is updated in parallel according to the rule a; = ai_1 XOR (ai OR ai+l ) (a; = (ai_1 +ai +ai+1 +aiai+l ) mod 2). Despite the simplicity of this rule, the time sequences of site values that it yields seem to be completely random. These sequences are analysed by a variety of empirical, combinatorial, statistical, dynamical systems theory and computation theory methods. An efficient random sequence generator based on them is suggested.
منابع مشابه
Pseudo-random sequences, boolean functions and cellular automata
Generation of pseudo-random binary sequences by one-dimensional cellular automata is surveyed using both uniform and hybrid automata. The updating function is a Boolean function that must satisfy criteria of resilience and nonlinearity for the sequence they generate to be secure for a stream cipher application.
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملFrom Complexity to Random Behaviors; Generate Random Numbers by Confusion in Cellular Automata State’s
Cellular Automata(CA) with evolutionary and complex behaviors are used in several applications such as generating random numbers and cryptography. Because of the intrinsic self-organizing property, pure CA cannot produce a long sequence of random numbers. For increasing the sequence of produced numbers, nonuniform CA, controllable/programmable CA, stimulating factors or combination of several a...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملBoolean Functions: Cryptography and Applications
Generation of pseudo-random binary sequences by one-dimensional cellular automata is surveyed using both uniform and hybrid automata. The updating function is a Boolean function that must satisfy criteria of resilience and nonlinearity for the sequence they generate to be secure for a stream cipher application.
متن کاملAnalysis of Elementary Cellular Automata Chaotic Rules Behavior
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013